home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
The Very Best of Atari Inside
/
The Very Best of Atari Inside 1.iso
/
mint
/
mint99s
/
asmtab.c
next >
Wrap
C/C++ Source or Header
|
1992-12-23
|
32KB
|
1,179 lines
/* A Bison parser, made from asm.y */
#define YYBISON 1 /* Identify Bison output. */
#define WORD 258
#define WHITESP 259
#define EOLN 260
#define STRING 261
#define DEFINECMD 262
#define INCLUDECMD 263
#define IFDEFCMD 264
#define IFNDEFCMD 265
#define ELSECMD 266
#define ENDIFCMD 267
#line 3 "asm.y"
#define YYSTYPE char *
#include "asmtrans.h"
#ifndef YYLTYPE
typedef
struct yyltype
{
int timestamp;
int first_line;
int first_column;
int last_line;
int last_column;
char *text;
}
yyltype;
#define YYLTYPE yyltype
#endif
#ifndef YYSTYPE
#define YYSTYPE int
#endif
#include <stdio.h>
#ifndef __STDC__
#define const
#endif
#define YYFINAL 87
#define YYFLAG -32768
#define YYNTBASE 25
#define YYTRANSLATE(x) ((unsigned)(x) <= 267 ? yytranslate[x] : 35)
static const char yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 15, 22, 2, 2, 2, 16,
17, 23, 18, 13, 19, 2, 24, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 14, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 20, 2, 21, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 2, 3, 4, 5,
6, 7, 8, 9, 10, 11, 12
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 1, 4, 6, 9, 12, 16, 21, 26, 33,
40, 45, 50, 53, 56, 59, 64, 68, 74, 76,
80, 82, 85, 87, 90, 94, 99, 104, 109, 114,
121, 128, 130, 134, 137, 139, 142, 144, 146, 148
};
#endif
static const short yyrhs[] = { -1,
25, 26, 0, 5, 0, 30, 5, 0, 27, 5,
0, 30, 27, 5, 0, 8, 4, 6, 5, 0,
8, 4, 3, 5, 0, 7, 4, 3, 4, 6,
5, 0, 7, 4, 3, 4, 31, 5, 0, 9,
4, 3, 5, 0, 10, 4, 3, 5, 0, 11,
5, 0, 12, 5, 0, 4, 29, 0, 4, 29,
4, 28, 0, 3, 4, 29, 0, 3, 4, 29,
4, 28, 0, 31, 0, 31, 13, 28, 0, 3,
0, 3, 14, 0, 32, 0, 15, 32, 0, 16,
32, 17, 0, 16, 32, 17, 18, 0, 19, 16,
32, 17, 0, 32, 16, 32, 17, 0, 16, 32,
17, 3, 0, 32, 16, 32, 13, 32, 17, 0,
32, 20, 32, 14, 32, 21, 0, 33, 0, 33,
34, 32, 0, 19, 32, 0, 3, 0, 22, 3,
0, 18, 0, 19, 0, 23, 0, 24, 0
};
#if YYDEBUG != 0
static const short yyrline[] = { 0,
22, 23, 26, 29, 30, 31, 33, 34, 35, 37,
39, 40, 41, 42, 45, 46, 49, 50, 55, 56,
60, 63, 65, 66, 67, 68, 69, 70, 71, 72,
74, 78, 79, 80, 82, 83, 86, 87, 88, 89
};
static const char * const yytname[] = { "$","error","$illegal.","WORD","WHITESP",
"EOLN","STRING","DEFINECMD","INCLUDECMD","IFDEFCMD","IFNDEFCMD","ELSECMD","ENDIFCMD",
"','","':'","'#'","'('","')'","'+'","'-'","'{'","'}'","'$'","'*'","'/'","input",
"line","opline","ops","opcode","label","operand","basic","basexpr","op",""
};
#endif
static const short yyr1[] = { 0,
25, 25, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 27, 27, 27, 27, 28, 28,
29, 30, 31, 31, 31, 31, 31, 31, 31, 31,
31, 32, 32, 32, 33, 33, 34, 34, 34, 34
};
static const short yyr2[] = { 0,
0, 2, 1, 2, 2, 3, 4, 4, 6, 6,
4, 4, 2, 2, 2, 4, 3, 5, 1, 3,
1, 2, 1, 2, 3, 4, 4, 4, 4, 6,
6, 1, 3, 2, 1, 2, 1, 1, 1, 1
};
static const short yydefact[] = { 1,
0, 0, 0, 3, 0, 0, 0, 0, 0, 0,
2, 0, 0, 0, 22, 21, 15, 0, 0, 0,
0, 13, 14, 5, 0, 4, 0, 17, 0, 0,
0, 0, 0, 0, 6, 0, 35, 0, 0, 0,
0, 16, 19, 23, 32, 0, 8, 7, 11, 12,
18, 0, 24, 0, 0, 34, 36, 0, 0, 0,
37, 38, 39, 40, 0, 0, 0, 25, 0, 20,
0, 0, 33, 9, 10, 29, 26, 27, 0, 28,
0, 0, 0, 30, 31, 0, 0
};
static const short yydefgoto[] = { 1,
11, 12, 42, 17, 13, 43, 44, 45, 65
};
static const short yypact[] = {-32768,
47, 1, 3,-32768, 44, 49, 56, 57, 58, 59,
-32768, 60, 8, 3,-32768,-32768, 62, 64, 30, 65,
66,-32768,-32768,-32768, 67,-32768, 68, 70, 13, 71,
72, 73, 74, 75,-32768, 13,-32768, 27, 27, 15,
69,-32768, 63, -12, 21, 4,-32768,-32768,-32768,-32768,
-32768, 27,-32768, 45, 27,-32768,-32768, 13, 27, 27,
-32768,-32768,-32768,-32768, 27, 76, 77, 6, 53,-32768,
25, 78,-32768,-32768,-32768,-32768,-32768,-32768, 27,-32768,
27, 79, 80,-32768,-32768, 83,-32768
};
static const short yypgoto[] = {-32768,
-32768, 81, -33, 84,-32768, 38, -38,-32768,-32768
};
#define YYLAST 101
static const short yytable[] = { 53,
54, 56, 51, 59, 14, 16, 37, 60, 76, 66,
25, 3, 26, 56, 15, 37, 69, 37, 38, 39,
71, 72, 40, 77, 70, 41, 73, 38, 39, 37,
55, 40, 31, 52, 41, 32, 41, 79, 61, 62,
82, 80, 83, 63, 64, 52, 86, 18, 41, 2,
3, 4, 19, 5, 6, 7, 8, 9, 10, 20,
21, 68, 22, 23, 24, 29, 30, 33, 34, 78,
14, 57, 35, 36, 46, 58, 47, 48, 49, 50,
74, 75, 87, 67, 0, 0, 0, 0, 0, 0,
0, 81, 0, 27, 0, 84, 0, 28, 0, 0,
85
};
static const short yycheck[] = { 38,
39, 40, 36, 16, 4, 3, 3, 20, 3, 6,
3, 4, 5, 52, 14, 3, 55, 3, 15, 16,
59, 60, 19, 18, 58, 22, 65, 15, 16, 3,
16, 19, 3, 19, 22, 6, 22, 13, 18, 19,
79, 17, 81, 23, 24, 19, 0, 4, 22, 3,
4, 5, 4, 7, 8, 9, 10, 11, 12, 4,
4, 17, 5, 5, 5, 4, 3, 3, 3, 17,
4, 3, 5, 4, 4, 13, 5, 5, 5, 5,
5, 5, 0, 46, -1, -1, -1, -1, -1, -1,
-1, 14, -1, 13, -1, 17, -1, 14, -1, -1,
21
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C. */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
#pragma alloca
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc. */
#endif /* not GNU C. */
#endif /* alloca not defined. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
/* Note: there must be only one dollar sign in this file.
It is replaced by the list of actions, each action
as one case of the switch. */
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEOF 0
#define YYACCEPT return(0)
#define YYABORT return(1)
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex()
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#define YYLEX yylex(&yylval, &yylloc)
#else
#define YYLEX yylex(&yylval)
#endif
#endif
/* If nonreentrant, generate the variables here */
#ifndef YYPURE
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
#ifdef YYLSP_NEEDED
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
#endif
int yynerrs; /* number of parse errors so far */
#endif /* not YYPURE */
#if YYDEBUG != 0
int yydebug; /* nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#endif
/* YYINITDEPTH indicates the initial size of the parser's stacks */
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
/* YYMAXDEPTH is the maximum size the stacks can grow to
(effective only if the built-in stack extension method is used). */
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
#define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT)
#else /* not GNU C or C++ */
#ifndef __cplusplus
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_bcopy (from, to, count)
char *from;
char *to;
int count;
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#else /* __cplusplus */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_bcopy (char *from, char *to, int count)
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#endif
#endif
#line 169 "bison.simple"
int
yyparse()
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus; /* number of tokens to shift before error messages enabled */
int yychar1; /* lookahead token as an internal (translated) token number */
short yyssa[YYINITDEPTH]; /* the state stack */
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
#ifdef YYLSP_NEEDED
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK (yyvsp--, yyssp--)
#endif
int yystacksize = YYINITDEPTH;
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
int yylen;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss - 1;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
#ifdef YYLSP_NEEDED
&yyls1, size * sizeof (*yylsp),
#endif
&yystacksize);
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
yyerror("parser stack overflow");
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
__yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
__yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
__yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
goto yybackup;
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Reading a token: ");
#endif
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
yychar1 = YYTRANSLATE(yychar);
#if YYDEBUG != 0
if (yydebug)
{
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
/* Give the individual parser a way to print the precise meaning
of a token, for further debugging info. */
#ifdef YYPRINT
YYPRINT (stderr, yychar, yylval);
#endif
fprintf (stderr, ")\n");
}
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 3:
#line 26 "asm.y"
{ emit(yyvsp[0]); ;
break;}
case 4:
#line 29 "asm.y"
{ emit(yyvsp[-1]); emit(yyvsp[0]); ;
break;}
case 5:
#line 30 "asm.y"
{ emit(yyvsp[-1]); emit(yyvsp[0]); ;
break;}
case 6:
#line 31 "asm.y"
{ emit(yyvsp[-2]); emit(yyvsp[-1]);
emit(yyvsp[0]); ;
break;}
case 7:
#line 33 "asm.y"
{ if (!hidecnt) do_include(yyvsp[-1]); free(yyvsp[-1]); ;
break;}
case 8:
#line 34 "asm.y"
{ if (!hidecnt) do_include(yyvsp[-1]); free(yyvsp[-1]); ;
break;}
case 9:
#line 35 "asm.y"
{
if (!hidecnt) do_define(yyvsp[-3], yyvsp[-1]); free(yyvsp[-3]); free(yyvsp[-1]); ;
break;}
case 10:
#line 37 "asm.y"
{
if (!hidecnt) do_define(yyvsp[-3], yyvsp[-1]); free(yyvsp[-3]); free(yyvsp[-1]); ;
break;}
case 11:
#line 39 "asm.y"
{ do_ifdef(yyvsp[-1]); free(yyvsp[-1]); ;
break;}
case 12:
#line 40 "asm.y"
{ do_ifndef(yyvsp[-1]); free(yyvsp[-1]); ;
break;}
case 13:
#line 41 "asm.y"
{ do_else(); ;
break;}
case 14:
#line 42 "asm.y"
{ do_endif(); ;
break;}
case 15:
#line 45 "asm.y"
{ yyval = do_ops("", yyvsp[0], "", ""); free(yyvsp[0]); ;
break;}
case 16:
#line 47 "asm.y"
{ yyval = do_ops("", yyvsp[-2], yyvsp[-1], yyvsp[0]);
free(yyvsp[-2]); free(yyvsp[-1]); free(yyvsp[0]); ;
break;}
case 17:
#line 49 "asm.y"
{ yyval = do_ops(yyvsp[-2], yyvsp[0], "", ""); free(yyvsp[-2]); free(yyvsp[0]); ;
break;}
case 18:
#line 51 "asm.y"
{ yyval = do_ops(yyvsp[-4], yyvsp[-2], yyvsp[-1], yyvsp[0]);
free(yyvsp[-4]); free(yyvsp[-2]); free(yyvsp[-1]); free(yyvsp[0]);;
break;}
case 19:
#line 55 "asm.y"
{ yyval = yyvsp[0]; ;
break;}
case 20:
#line 56 "asm.y"
{ yyval = concat3(yyvsp[-2], ",", yyvsp[0]);
free(yyvsp[-2]); free(yyvsp[0]); ;
break;}
case 21:
#line 60 "asm.y"
{ yyval = wordlookup(yyvsp[0]); free(yyvsp[0]); ;
break;}
case 22:
#line 63 "asm.y"
{ yyval = concat(yyvsp[-1], ":"); free(yyvsp[-1]); ;
break;}
case 23:
#line 65 "asm.y"
{yyval = yyvsp[0]; ;
break;}
case 24:
#line 66 "asm.y"
{yyval = immediate(yyvsp[0]); free(yyvsp[0]); ;
break;}
case 25:
#line 67 "asm.y"
{yyval = indirect(yyvsp[-1]); free(yyvsp[-1]); ;
break;}
case 26:
#line 68 "asm.y"
{yyval = postinc(yyvsp[-2]); free(yyvsp[-2]); ;
break;}
case 27:
#line 69 "asm.y"
{yyval = predec(yyvsp[-1]); free(yyvsp[-1]); ;
break;}
case 28:
#line 70 "asm.y"
{yyval = indexed(yyvsp[-3], yyvsp[-1]); free(yyvsp[-3]); free(yyvsp[-1]); ;
break;}
case 29:
#line 71 "asm.y"
{yyval = sizedop(yyvsp[-2], yyvsp[0]); free(yyvsp[-2]); free(yyvsp[0]); ;
break;}
case 30:
#line 72 "asm.y"
{yyval = twoindex(yyvsp[-5], yyvsp[-3], yyvsp[-1]);
free(yyvsp[-5]); free(yyvsp[-3]); free(yyvsp[-1]); ;
break;}
case 31:
#line 74 "asm.y"
{yyval = bitfield(yyvsp[-5], yyvsp[-3], yyvsp[-1]);
free(yyvsp[-5]); free(yyvsp[-3]); free(yyvsp[-1]); ;
break;}
case 32:
#line 78 "asm.y"
{ yyval = yyvsp[0]; ;
break;}
case 33:
#line 79 "asm.y"
{ yyval = concat3(yyvsp[-2], yyvsp[-1], yyvsp[0]); free(yyvsp[-2]); free(yyvsp[-1]); free(yyvsp[0]); ;
break;}
case 34:
#line 80 "asm.y"
{ yyval = concat("-", yyvsp[0]); free(yyvsp[0]); ;
break;}
case 35:
#line 82 "asm.y"
{yyval = wordlookup(yyvsp[0]); free(yyvsp[0]); ;
break;}
case 36:
#line 83 "asm.y"
{yyval = hexop(yyvsp[0]); free(yyvsp[0]);;
break;}
case 37:
#line 86 "asm.y"
{ yyval = strdup("+"); ;
break;}
case 38:
#line 87 "asm.y"
{ yyval = strdup("-"); ;
break;}
case 39:
#line 88 "asm.y"
{ yyval = strdup("*"); ;
break;}
case 40:
#line 89 "asm.y"
{ yyval = strdup("/"); ;
break;}
}
/* the action file gets copied in in place of this dollarsign */
#line 442 "bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* Now "shift" the result of the reduction.
Determine what state that goes to,
based on the state we popped back to
and the rule number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
for (x = 0; x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) malloc(size + 15);
if (msg != 0)
{
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = 0; x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(msg);
free(msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
}
else
#endif /* YYERROR_VERBOSE */
yyerror("parse error");
}
goto yyerrlab1;
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
}
#line 91 "asm.y"
#include <setjmp.h>
jmp_buf start;
#ifdef NATIVEATARI
#define STACK 32*1024L;
#ifdef LATTICE
long _STACK = STACK;
#endif
#ifdef __GNUC__
long _stksize = STACK;
#endif
static void
hit_return()
{
printf("Hit return to continue\n");
fflush(stdout);
getchar();
}
#endif
void usage()
{
fprintf(stderr, "Usage: asmtrans [-gas][-asm][-o outfile] infile\n");
exit(2);
}
int errors = 0;
void
do_include(file)
char *file;
{
jmp_buf save;
FILE *oldin, *f;
f = fopen(file, "r");
if (!f) {
perror(file);
return;
}
bcopy(start, save, sizeof(jmp_buf));
oldin = infile;
infile = f;
setjmp(start);
yyparse();
fclose(f);
infile = oldin;
bcopy(save, start, sizeof(jmp_buf));
longjmp(start,1);
}
/* set up initial definitions based on syntax type */
void
do_initial_defs()
{
if (syntax == GAS) {
do_define("fpiar", "fpi");
do_define("XREF", ".globl");
do_define("XDEF", ".globl");
do_define("TEXT", ".text");
do_define("DATA", ".data");
/* gas doesn't have a .bss directive */
do_define("BSS", ".data");
do_define("END", "| END");
do_define("dc.l", ".long");
do_define("dc.w", ".word");
do_define("dc.b", ".byte");
} else if (syntax == ASM) {
do_define("TEXT", "SECTION TEXT");
do_define("DATA", "SECTION DATA");
do_define("BSS", "SECTION BSS");
}
}
int
main (argc, argv)
int argc; char **argv;
{
FILE *f;
#ifdef NATIVEATARI
if (!argv[0] || !argv[0][0]) /* run from desktop? */
atexit(hit_return);
#endif
argv++;
outfile = stdout;
while (*argv) {
if (!strcmp(*argv, "-o")) {
argv++;
if (*argv == 0) {
fprintf(stderr, "missing argument to -o\n");
usage();
}
f = fopen(*argv, "w");
if (!f)
perror(*argv);
else
outfile = f;
argv++;
} else if (!strcmp(*argv, "-gas")) {
argv++;
syntax = GAS;
} else if (!strcmp(*argv, "-asm")) {
argv++;
syntax = ASM;
} else if (!strcmp(*argv, "-purec")) {
argv++;
syntax = PUREC;
} else if (!strncmp(*argv, "-D", 2)) {
char *word, *defn;
word = *argv+2;
defn = index(word,'=');
if (defn)
*defn++ = '\0';
else
defn = "1";
if (*word) do_define(word,defn);
argv++;
} else if (!strcmp(*argv, "--")) {
argv++;
break;
} else {
if (**argv == '-') {
fprintf(stderr, "unknown option: %s\n",
*argv);
usage();
}
break;
}
}
do_initial_defs();
if (*argv == 0) {
setjmp(start);
infile = stdin;
yyparse();
} else {
while(*argv) {
if (!(f = fopen(*argv, "r")))
perror(*argv);
else {
infile = f;
setjmp(start);
yyparse();
fclose(f);
}
argv++;
}
}
if (ifstkptr != 0) {
fputs("%ifdef without matching %endif\n", stderr);
errors++;
}
return errors;
}
void
yyerror (s) /* Called by yyparse on error */
char *s;
{
errors++;
printf("%s\n", s);
longjmp(start, 1);
}
void dbgmsg(s) char *s;
{
fprintf(stderr, "%s\n", s);
}